Massively Parallel Simulated Annealing and Its Relation to Evolutionary Algorithms
نویسنده
چکیده
Simulated annealing and and single trial versions of evolution strategies possess a close relationship when they are designed for optimization over continuous variables. Analytical investigations of their diierences and similarities lead to a cross-fertilization of both approaches, resulting in new theoretical results, new parallel population based algorithms, and a better understanding of the interrelationships.
منابع مشابه
Hybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility
This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...
متن کاملEvolutionary Computation on the Connex Architecture
We discuss massively parallel implementation issues of the following heuristic optimization methods: Evolution Strategy, Genetic Algorithms, Harmony Search, and Simulated Annealing. For the first time, we implement these algorithms on the Connex architecture, a recently designed array of 1024 processing elements. We use the Vector-C programming environment, an extension of the C language adapte...
متن کاملMassively Parallel GAs for Protein Structure Prediction
Proteins play an important role in medicine, biology and chemistry. Very often the conformation of a given protein is of great interest. Genetic Algorithms have already been applied successfully in this eld. This paper examines the use of Massively Parallel Genetic Algorithms in combination with local search strategies and a simulated annealing approach to predict protein structures.
متن کاملA Perspective on Evolutionary Computation
During the last three decades there has been a growing interest in algorithms which rely on analogies to natural processes. The emergence of massively parallel computers made these algorithms of practical interest. The best known algorithms in this class include evolutionary programming, genetic algorithms, evolution strategies, simulated annealing, classi er systems, and neural networks. In th...
متن کاملN-ary Speculative Computation of Simulated Annealing on the AP1000 Massively Parallel Multiprocessor
Simulated annealing is known to be an efficient method for combinatorial optimization problems. Its usage for realistic problem size, however, has been limited by the long execution time due to its sequential nature. This report presents a practical approach to synchronous simulated annealing for massively parallel distributed-memory multiprocessors. We use an n-ary speculative tree to execute ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Evolutionary Computation
دوره 1 شماره
صفحات -
تاریخ انتشار 1993